Gröbner bases and generalized sylvester matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gröbner bases and generalized Padé approximation

It is shown how to find general multivariate Padé approximation using the Gröbner basis technique. This method is more flexible than previous approaches, and several examples are given to illustrate this advantage. When the number of variables is small compared to the degree of approximation, the Gröbner basis technique is more efficient than the linear algebra methods in the literature.

متن کامل

Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases

Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...

متن کامل

Parallel Reduction of Matrices in Gröbner Bases Computations

Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24 Motivation Gröbner bases are used, to solve polynomial equation systems, move robotics, verify programs,. .. Unfortunately the computation is time-and memory intensive. Mathematic...

متن کامل

Counting and Gröbner Bases

Gröbner bases were introduced by Buchberger (1965) and are now firmly established as a tool in Commutative Algebra and other areas. The reader is referred to Buchberger (1985), Cox, Little and O’Shea (1992) or Becker and Weispfenning (1993) for more information. Eisenbud (1995) places Gröbner bases within the context of more advanced Commutative Algebra. The ingredients for a Gröbner basis are ...

متن کامل

Regular Gröbner Bases

In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Communications in Computer Algebra

سال: 2011

ISSN: 1932-2240

DOI: 10.1145/2016567.2016594